A linear time algorithm for the backup 2-center problem on a tree
نویسندگان
چکیده
In this paper, we are concerned with the problem of deploying two servers in a tree network, where each server may fail with a given probability. Once a server fails, the other server will take the whole responsibility of service for all vertices (clients). Here, we assume that the servers do not fail simultaneously. In the backup 2-center problem, we want to deploy two servers at the vertices such that the expected distance from a farthest vertex to the nearest surviving server is minimum. We shall propose an O(n)-time algorithm for the backup 2-center problem, where n is the number of vertices in the given tree network.
منابع مشابه
Designing a green location routing inventory problem considering transportation risks and time window: a case study
This study introduces a green location, routing and inventory problem with customer satisfaction, backup distribution centers and risk of routes in the form of a non-linear mixed integer programming model. In this regard, time window is considered to increase the customer satisfaction of the model and transportation risks is taken into account for the reliability of the system. In addition, dif...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کامل(n,1,1,α)-Center Problem
Given a set of points in the plane and a constant ,-center problem is to find two closed disks which each covers the whole , the diameter of the bigger one is minimized, and the distance of the two centers is at least . Constrained -center problem is the -center problem in which the centers are forced to lie on a given line . In this paper, we first introduce -center problem and its constrain...
متن کاملBack - up 2 - Center on a 1 Path / Tree / Cycle / Unicycle Network
This paper addresses the problem of locating two facilities 11 in vertex-weighted tree/cycle/unicycle networks, where each facility can 12 fail with a given probability [16]. It is assumed that the two facilities 13 do not fail simultaneously, and when a facility fails, the other facility is 14 required to service all the vertices. We show that the back-up 2-center on 15 a weighted path (resp. ...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007